On Transformations of Constant Depth Propositional Proofs
نویسندگان
چکیده
This paper studies the complexity of constant depth propositional proofs in the cedent and sequent calculus. We discuss the relationships between the size of tree-like proofs, the size of dag-like proofs, and the heights of proofs. The main result is to correct a proof construction in an earlier paper about transformations from proofs with polylogarithmic height and constantly many formulas per cedent.
منابع مشابه
Bounded Arithmetic and Constant Depth Frege Proofs
We discuss the Paris-Wilkie translation from bounded arithmetic proofs to bounded depth propositional proofs in both relativized and non-relativized forms. We describe normal forms for proofs in bounded arithmetic, and a definition of Σ -depth for PK-proofs that makes the translation from bounded arithmetic to propositional logic particularly transparent. Using this, we give new proofs of the w...
متن کاملEquational calculi and constant depth propositional proofs
We deene equational calculi for proving equations between functions in the complexity classes ACC(2) and TC 0 , and we show that proofs in these calculi can be simulated by polynomial size, constant depth proofs in Frege systems with counting modulo 2 and threshold connectives respectively.
متن کاملSeparation results for the size of constant-depth propositional proofs
This paper proves exponential separations between depth d -LK and depth (d + 1 2 )-LK for every d ∈ 1 2 N utilizing the order induction principle. As a consequence, we obtain an exponential separation between depth d -LK and depth (d+1)-LK for d ∈ N . We investigate the relationship between the sequence-size, tree-size and height of depth d -LK-derivations for d ∈ 1 2 N , and describe transform...
متن کاملResolution Proofs of Generalized Pigeonhole Principles
We extend results of A. Haken to give an exponential lower bound on the size of resolution proofs for propositional formulas encoding a generalized pigeonhole principle. These propositional formulas express the fact that there is no one-one mapping from c ·n objects to n objects when c > 1. As a corollary, resolution proof systems do not p -simulate constant formula depth Frege proof systems.
متن کاملFeasible interpolation for lifted sequents
The idea of feasible interpolation for propositional proof systems is to derive lower bounds for propositional proofs using circuit lower bounds for Craig’s interpolant. However, as far as we know, proof systems such as constant-depth Frege do not admit feasible interpolation. We extend the notion of feasible interpolation so that it is admitted by a number of treelike propositional proof syste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017